- universally quantified
- связанный квантором всеобщности
Англо-русский словарь по робототехнике. 2013.
Англо-русский словарь по робототехнике. 2013.
True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Alternating Turing machine — In computational complexity theory, an alternating Turing machine (ATM) is a non deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co NP.… … Wikipedia
Universal quantification — In predicate logic, universal quantification is an attempt to formalize the notion that something (a logical predicate) is true for everything , or every relevant thing.The resulting statement is a universally quantified statement, and we have… … Wikipedia
Herbrandization — The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf Skolem had considered the Skolemizations of formulas in prenex form as part of his proof of the… … Wikipedia
Attempto Controlled English — (ACE) is a controlled natural language, i.e. a subset of standard English with a restricted syntax and a restricted semantics described by a small set of construction and interpretation rules [cite conference | author = Norbert E. Fuchs, Kaarel… … Wikipedia
Tarski's axioms — Tarski s axioms, due to Alfred Tarski, are an axiom set for the substantial fragment of Euclidean geometry, called elementary, that is formulable in first order logic with identity, and requiring no set theory. Other modern axiomizations of… … Wikipedia
Scott–Potter set theory — An approach to the foundations of mathematics that is of relatively recent origin, Scott–Potter set theory is a collection of nested axiomatic set theories set out by the philosopher Michael Potter, building on earlier work by the mathematician… … Wikipedia
Henry E. Kyburg, Jr. — Henry E. Kyburg, Jr. (1928 – 2007) was Gideon Burbank Professor of Moral Philosophy and Professor of Computer Science at the University of Rochester, New York, and Pace Eminent Scholar at The Institute for Human and Machine Cognition, Pensacola,… … Wikipedia
Universal algebra — (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ( models ) of algebraic structures.For instance, rather than take particular groups as the object of study, in universal… … Wikipedia